Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals

نویسندگان

چکیده

Probabilistic team semantics is a framework for logical analysis of probabilistic dependencies. Our focus on the axiomatizability, complexity, and expressivity inclusion logic its extensions. We identify natural fragment existential second-order with additive real arithmetic that captures exactly logic. furthermore relate these formalisms to linear programming, doing so obtain PTIME data complexity logics. Moreover, finite structures, we show full can only express NP properties. Lastly, present sound complete axiomatization at atomic level.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existential Second-order Logic over Strings Existential Second-order Logic over Strings – Modified March 1998 –

Existential second-order logic (ESO) and monadic second-order logic (MSO) have attracted much interest in logic and computer science. ESO is a much more expressive logic over word structures than MSO. However, little was known about the relationship between MSO and syntactic fragments of ESO. We shed light on this issue by completely characterizing this relationship for the prefix classes of ES...

متن کامل

Probabilistic Inference and Monadic Second Order Logic

This paper combines two classic results from two different fields: the result by Lauritzen and Spiegelhalter [21] that the probabilistic inference problem on probabilistic networks can be solved in linear time on networks with a moralization of bounded treewidth, and the result by Courcelle [10] that problems that can be formulated in counting monadic second order logic can be solved in linear ...

متن کامل

One Quantifier Will Do in Existential Monadic Second-Order Logic over Pictures

We show that every formula of the existential fragment of monadic second-order logic over picture models (i.e., nite, two-dimensional , coloured grids) is equivalent to one with only one existential monadic quantiier. The corresponding claim is true for the class of word models ((Tho82]) but not for the class of graphs ((Ott95]). The class of picture models is of particular interest because it ...

متن کامل

Incremental Algorithms for Local Search from Existential Second-Order Logic

Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consuming and error-prone implementation tasks. We introduce a scheme that, from a high-level description of a constraint in existential second-order logic with counting, automatically synthesises incremental penalty calcu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2022

ISSN: ['0168-0072', '1873-2461']

DOI: https://doi.org/10.1016/j.apal.2022.103108